On the Sensitivity Complexity of <i>k</i> -Uniform Hypergraph Properties

In this article, we investigate the sensitivity complexity of hypergraph properties. We present a k -uniform property with O ( n (⌈ k/3 ⌉) for any ≥ 3 , where is number vertices. Moreover, can do better when ≡ 1 (mod 3) by presenting (n⌈ ⌉-1/2). This result disproves conjecture Babai, which conjectures that properties at least Ω k/2 ). also other symmetric functions and show many classes transitive Boolean minimum achievable be (N 1/3 ), N variables.